Turing Completeness in the Language of Genetic Programming with Indexed Memory
نویسنده
چکیده
Genetic Programming is a method for evolving functions that find approximate or exact solutions to problems. There are many problems that traditional Genetic Programming (GP) cannot solve, due to the theoretical limitations of its paradigm. A Turing machine (TM) is a theoretical abstraction that express the extent of the computational power of algorithms. Any system that is Turing complete is sufficiently powerful to recognize all possible algorithms. GP is not Turing complete. This paper will prove that when GP is combined with the technique of indexed memory, the resulting system is Turing complete. This means that, in theory, GP with indexed memory can be used to evolve any algorithm.
منابع مشابه
Evolving Turing-Complete Programs for a Register Machine with Self-modifying Code
The majority of commercial computers today are register machines of von Neumann type. We have developed a method to evolve Turing-complete programs for a register machine. The described implementation enables the use of most program constructs, such as arithmetic operators, large indexed memory, automatic decomposition into subfunctions and subroutines (ADFs), conditional constructs i.e. if-the...
متن کاملNeural Associative Memory with Finite State Technology
Morphological learning approaches have been successfully applied to morphological tasks in computational linguistics including morphological analysis and generation. We take a new look at the fundamental properties of associative memory along with the power of turing machine and show how it can be adopted for natural language processing. The ability to store and recall stored patterns based on ...
متن کاملThe Halting Probability in Von Neumann Architectures
Theoretical models of Turing complete linear genetic programming (GP) programs suggest the fraction of halting programs is vanishingly small. Convergence results proved for an idealised machine, are tested on a small T7 computer with (finite) memory, conditional branches and jumps. Simulations confirm Turing complete fitness landscapes of this type hold at most a vanishingly small fraction of u...
متن کاملSome improvements in fuzzy turing machines
In this paper, we improve some previous definitions of fuzzy-type Turing machines to obtain degrees of accepting and rejecting in a computational manner. We apply a BFS-based search method and some level’s upper bounds to propose a computational process in calculating degrees of accepting and rejecting. Next, we introduce the class of Extended Fuzzy Turing Machines equipped with indeterminacy s...
متن کاملTuring-complete data structure for genetic programming
In generating a program automatically, if we do not know whether the problem is solvable or not in advance, then the representation of the program must be Turing-complete, i.e. the representation must be able to express any algorithms. However, a tree structure used by the standard Genetic Programming is not Turingcomplete. We propose a representation scheme, which is a recurrent network consis...
متن کامل